Yahtzee: An Anonymized Group Level Matching Procedure

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Yahtzee: An Anonymized Group Level Matching Procedure

Researchers often face the problem of needing to protect the privacy of subjects while also needing to integrate data that contains personal information from diverse data sources. The advent of computational social science and the enormous amount of data about people that is being collected makes protecting the privacy of research subjects ever more important. However, strict privacy procedures...

متن کامل

Matching Anonymized and Obfuscated Time Series to Users' Profiles

Many popular applications use traces of user data to offer various services to their users; example applications include driver-assistance systems and smart home services. However, revealing user information to such applications puts users’ privacy at stake, as adversaries can infer sensitive private information about the users such as their behaviors, interests, and locations. Recent research ...

متن کامل

Fitting Second-order Models to Mixed Two-level and Four-level Factorial Designs: Is There an Easier Procedure?

Fitting response surface models is usually carried out using statistical packages to solve complicated equations in order to produce the estimates of the model coefficients. This paper proposes a new procedure for fitting response surface models to mixed two-level and four-level factorial designs. New and easier formulae are suggested to calculate the linear, quadratic and the interaction coeff...

متن کامل

An Exhaustive Matching Procedure for the Improvement of Learning Efficiency

Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of larger systems (e.g., learning systems). Hence, the need of techniques that can speed up such a process. This paper proposes a new algorithm for matching first-order logic descriptions under θ-subsumption that is able to return ...

متن کامل

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PLoS ONE

سال: 2013

ISSN: 1932-6203

DOI: 10.1371/journal.pone.0055760